|
In computer science, dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure.〔Fredman, M. L., Komlós, J., and Szemerédi, E. 1984. Storing a Sparse Table with 0(1) Worst Case Access Time. J. ACM 31, 3 (Jun. 1984), 538-544 http://portal.acm.org/citation.cfm?id=1884#〕〔 Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E. 1994. ("Dynamic Perfect Hashing: Upper and Lower Bounds" ). SIAM J. Comput. 23, 4 (Aug. 1994), 738-761. http://portal.acm.org/citation.cfm?id=182370 〕〔 Erik Demaine, Jeff Lind. (6.897: Advanced Data Structures ). MIT Computer Science and Artificial Intelligence Laboratory. Spring 2003. 〕 While more memory-intensive than its hash table counterparts, this technique is useful for situations where fast queries, insertions, and deletions must be made on a large set of elements. ==Details== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「dynamic perfect hashing」の詳細全文を読む スポンサード リンク
|